Irreversible 2-conversion set is NP-complete
نویسندگان
چکیده
An irreversible k-threshold process is a process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set is a subset S of vertices of a graph G such that the irreversible k-threshold process changes all vertices of G to black if S is the initial set of black vertices. We show that deciding the existence of an irreversible 2-conversion set of a given size is NP-complete which answers a question of Dreyer and Roberts. Moreover, we show an optimal irreversible 3-conversion set for a toroidal grid, which simplifies constructions of Pike and Zou.
منابع مشابه
Irreversible 2 - conversion set is NP - complete ∗ † Jan
An irreversible k-threshold process is a process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set is a subset S of vertices of a graph G such that the irreversible k-threshold process changes all vertices of G to black if S is the initial set of black vertices. We show that deciding the existence of an irreversi...
متن کاملIrreversible 2-conversion set in graphs of bounded degree
An irreversible k-threshold process (also a k-neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set of a graph G is a subset S of vertices of G such that the irreversible k-threshold process starting with S black eventually changes all vertices of G to black. We sh...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملIrreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
In graph theoretical models of the spread of disease through populations, the spread of opinion through social networks, and the spread of faults through distributed computer networks, vertices are in two states, either black or white, and these states are dynamically updated at discrete time steps according to the rules of the particular conversion process used in the model. This paper conside...
متن کاملA Note on Irreversible 2-Conversion Sets in Subcubic Graphs
Irreversible k-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or opinions. We show that the problem to find a minimum irreversible 2-conversion set can be solved in O(n2 log6 n) time for graphs with maximum degree at most 3 (subcubic graphs) by reducing it to the graphic matroid parity problem, where n is the number of vertices in a graph. Th...
متن کامل